Ant-Q Hyper Heuristic Approach applied to the Cross- domain Heuristic Search Challenge problems
نویسنده
چکیده
The first Cross-domain Heuristic Search Challenge (CHeSC 2011) is an international research competition aimed at measuring hyperheuristics performance over several problem domains. Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. During this competition, we have applied the Ant-Q hyper-heuristic approach, proposed by Khamassi et al., for building good sequences of low-level heuristics aimed at finding optimal solutions. This approach was applied to the MAX-SAT Problem, the One Dimensional Bin Packing Problem, the Permutation Flow Shop Problem and the Personnel Scheduling Problem; and tested through a large set of benchmark problems.
منابع مشابه
Hyper-heuristics for cross-domain search
In this paper we present two hyper-heuristics developed for the Cross-Domain Heuristic Search Challenge. Hyper-heuristics solve hard combinatorial problems by guiding low level heuristics, rather than by manipulating problem solutions directly. Two hyper-heuristics are presented: Five Phase Approach and Genetic Hive. Development paths of the algorithms and testing methods are outlined. Performa...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملCross-domain Heuristic Search Challenge: GISS Algorithm presentation
Generic Iterative Simulated-Annealing Search (GISS) is a hyper-heuristic algorithm inspired on a Simulated Annealing driven method, on this context its used to explore across the different instance-heuristicstate search space. On this extended abstract we describe the proposed approach, characteristics and others technicals parameters.
متن کاملAn Evolutionary Programming Hyper-heuristic with Co-evolution for CHeSC’11
We present an Evolutionary Programming Hyper-heuristic (EPH) implemented for the Cross-Domain Heuristic Search Challenge 2011. The proposed method combines an evolutionary programming approach and co-evolution. The solving process of EPH consists in evolving a population of solutions by applying heuristics sequences. The heuristics sequences are also in a population and evolve according to thei...
متن کاملKSATS-HH: A Simulated Annealing Hyper-Heuristic with Reinforcement Learning and Tabu-Search
The term hyper-heuristics describes a broad range of techniques that attempt to provide solutions to an array of problems from different domains. This paper describes the implementation of a hyperheuristic developed for entry into the Cross-domain Heuristic Search Challenge organised by the Automated Scheduling, Optimisation and Planning research group at the University of Nottingham. An algori...
متن کامل